Incremental Layout in DynaDAG
نویسنده
چکیده
E ective techniques have been developed for some important families of graph layouts, such as hierarchies, planar embeddings, orthogonal grids and forced-directed (spring) models [1]. These techniques have been incorporated in practical user interfaces that display static diagrams of relationships between objects [19, 18, 17]. Static diagrams are not completely satisfactory because in many situations, the displayed graphs can change. Three common scenarios are: Manual editing. Most interactive graph drawing systems allow users to manually insert and delete nodes and edges. Layouts must be updated dynamically to re ect such changes. Browsing large graphs. When only static layout is available, browsing large graphs usually means drawing the entire graph and then viewing portions in a window with pan and zoom controls, sheye lenses, etc. The problem is that the section in the current window may not be very informative. For example it may contain edge segments whose endpoint nodes are outside the window, or nodes whose placement can be rationalized globally but not locally. Incremental layout o ers the alternative of directly adjusting the set of displayed objects to make informative displays. Visualizing dynamic graphs.Often, data being visualized is subject to change. In our experience with the dotty system, we found many applications for graph animations:
منابع مشابه
A new layout-driven timing model for incremental layout optimization
In this paper we present a new layout-driven timing model based on Asymptotic Waveform Evaluation (AWE) for improved timing analysis during routing. Our model enables the bottom-up computation of interconnect tree moments, and can be easily integrated with such a global router. Such an integration achieves incremental layout optimization, i.e., timing analysis and routing are tightly coupled, w...
متن کاملA Pattern-based Approach for Initial Diagram Layout
In a diagram editor, one can distinguish initial from incremental diagram layout. The former computes a diagram layout from scratch, whereas the latter adjusts an existing layout after diagram modifications. In previous work, we have proposed a pattern-based approach as a solution for incremental diagram layout in visual language editors. Each LP encapsulates certain layout behavior. A diagram’...
متن کاملIncremental Timing Driven Placement
Standard cell layouts may need only slight modifications to meet timing constraints. In these situations, general purpose algorithms, which consider numerous parameters of the layout, may be too time consuming or too coarse to make the changes where needed. This paper presents an incremental timing driven placement algorithm designed to “cleanup” a handful of critical paths in a previously plac...
متن کاملAn incremental construction algorithm for Venn diagrams
The drawing of Venn diagrams have traditionally served as an aid to analyze the characteristics exhibited by the diagram and its underlying Venn graph. Little attention has hitherto been given to the presentation, construction and way in which a Venn diagram conveys information. We present a new algorithm for the construction and layout of a Venn diagram based on an incremental technique. The a...
متن کاملIncremental Grid-Like Layout Using Soft and Hard Constraints
Abstract. We explore various techniques to incorporate grid-like layout conventions into a force-directed, constraint-based graph layout framework. In doing so we are able to provide high-quality layout—with predominantly axis-aligned edges—that is more flexible than previous gridlike layout methods and which can capture layout conventions in notations such as SBGN (Systems Biology Graphical No...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995